A new approach for similarity queries using proximity graphs
نویسندگان
چکیده
Proximity graphs have been widely used in the area of computational geometry; through a vicinity concept these graphs establish relations of similarity between elements of a set. In this paper we propose the use of Relative Neighborhood Graph (RNG) in metric spaces in order to efficiently answer similarity queries. Additionally we introduce a new algorithm for range queries and nearest neighbor queries making use of the spatial approximation in graphs. Experiments show that our proposal has a comparable performance in terms of Number of Distance Calculations (NDC) and time.
منابع مشابه
A new approach for similarity queries using neighborhood graphs
Proximity graphs have been widely used in the area of computational geometry; through a vicinity concept these graphs establish relations of similarity between elements of a set. In this paper we propose the use of Relative Neighborhood Graph (RNG) in metric spaces in order to efficiently answer similarity queries. Additionally we introduce a new algorithm for range queries and nearest neighbor...
متن کاملProviding a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کاملA New Similarity Measure Based on Item Proximity and Closeness for Collaborative Filtering Recommendation
Recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. User similarity measurement plays an important role in collaborative filtering based recommender systems. In order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...
متن کاملBest Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions. We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کامل